منابع مشابه
Robust Linear Quadratic Control of Systems with Integral Quadratic Constraints
In this paper, we consider the robust linear quadratic (LQ) control problem for a class of uncertain linear systems which are subject to a general type of integral quadratic constraints (IQCs). Both analysis and synthesis problems are considered in this paper. For the analysis problem, we determine if the system satisses a desired linear quadratic performance index for all admissible uncertaint...
متن کاملStability of Linear-Quadratic Minimization over Euclidean Balls
Stability properties of the problem of minimizing a (nonconvex) linear-quadratic function over an Euclidean ball, known as the trust-region subproblem, are studied in this paper. We investigate in detail the case where the linear part of the objective function is perturbed and obtain necessary and sufficient conditions for the upper/lower semicontinuity of the Karush-Kuhn-Tucker point set map a...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملOn the duality of quadratic minimization problems using pseudo inverses
In this paper we consider the minimization of a positive semidefinite quadratic form, having a singular corresponding matrix $H$. We state the dual formulation of the original problem and treat both problems only using the vectors $x in mathcal{N}(H)^perp$ instead of the classical approach of convex optimization techniques such as the null space method. Given this approach and based on t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1978
ISSN: 0022-247X
DOI: 10.1016/0022-247x(78)90154-3